Non-monotonic Pre-fixed Points and Learning
نویسندگان
چکیده
منابع مشابه
Non-monotonic Pre-fix Points and Learning
We consider the problem of finding pre-fixed points of interactive realizers over arbitrary knowledge spaces, obtaining a relative recursive procedure. Knowledge spaces and interactive realizers are an abstract setting to represent learning processes, that can interpret non-constructive proofs. Atomic pieces of information of a knowledge space are stratified into levels, and evaluated into trut...
متن کاملEpistemic Semantics for Fixed-Points Non-Monotonic Logics
1 I N T R O D U C T I O N Exist ing nonmonotonic logics can be divided roughly into two kinds. One is based on fixed points, like default logic [Reiter 1980] or autoepistemic logic ([Moore 1983], [Konolige 1988], and [Levesque 1989]). The other is based on minimal models, like circumscription ( [McCarthy 1980, 1984] and [Lifschitz 1987]) or minimal knowledge ([Halpern and Moses 1984], [Shoham 1...
متن کاملNon-monotonic Learning
This paper addresses methods of specialising rst-order theories within the context of incremental learning systems. We demonstrate the shortcomings of existing rst-order incremental learning systems with regard to their specialisation mechanisms. We prove that these shortcomings are fundamental to the use of classical logic. In particular, minimal \correct-ing" specialisations are not always ob...
متن کاملDiagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملA fixed point theorem for non-monotonic functions
We present a fixed point theorem for a class of (potentially) non-monotonic functions over specially structured complete lattices. The theorem has as a special case the KnasterTarski fixed point theorem when restricted to the case of monotonic functions and Kleene’s theorem when the functions are additionally continuous. From the practical side, the theorem has direct applications in the semant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.126.1